Observability of a Linear System Under Sparsity Constraints
نویسندگان
چکیده
منابع مشابه
Technical Report: Observability of a Linear System under Sparsity Constraints
Consider an n−dimensional linear system where it is known that there are at most k < n non-zero components in the initial state. The observability problem, that is the recovery of the initial state, for such a system is considered. We obtain sufficient conditions on the number of the available observations to be able to recover the initial state exactly for such a system. Both deterministic and...
متن کاملStable recovery of deep linear networks under sparsity constraints
We study a deep linear network expressed under the form of a matrix factorization problem. It takes as input a matrix X obtained by multiplying K matrices (called factors and corresponding to the action of a layer). Each factor is obtained by applying a fixed linear operator to a vector of parameters satisfying a sparsity constraint. In machine learning, the error between the product of the est...
متن کاملEstimation of Covariance Matrices under Sparsity Constraints
Discussion of “Minimax Estimation of Large Covariance Matrices under L1-Norm” by Tony Cai and Harrison Zhou. To appear in Statistica Sinica. Introduction. Estimation of covariance matrices in various norms is a critical issue that finds applications in a wide range of statistical problems, and especially in principal component analysis. It is well known that, without further assumptions, the em...
متن کاملOnline Linear Optimization with Sparsity Constraints
We study the problem of online linear optimization with sparsity constraints in the 1 semi-bandit setting. It can be seen as a marriage between two well-known problems: 2 the online linear optimization problem and the combinatorial bandit problem. For 3 this problem, we provide two algorithms which are efficient and achieve sublinear 4 regret bounds. Moreover, we extend our results to two gener...
متن کاملOnline Linear Optimization with Sparsity Constraints
We study the problem of online linear optimization with sparsity constraints in the 1 semi-bandit setting. It can be seen as a marriage between two well-known problems: 2 the online linear optimization problem and the combinatorial bandit problem. For 3 this problem, we provide two algorithms which are efficient and achieve sublinear 4 regret bounds. Moreover, we extend our results to two gener...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2013
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2013.2253272